The visibility graph contains a bounded-degree spanner
نویسنده
چکیده
Given a collection of polygonal obstacles with n vertices on the place, and any t > 1, we present an O(n logn) time algorithm that constructs a bounded-degree t-spanner of the visibility graph, without rst having to construct the visibility graph.
منابع مشابه
On Geometric Spanners of Euclidean and Unit Disk Graphs
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor Cdel ≈ 2.42; however, its degree may not be bounded. Our first result is a very simple linear time algorithm for constructing a subgraph of the Delaunay graph with stretch factor ρ = 1 + ...
متن کاملOn Geometric Spanners of Euclidean Graphs and their Applications in Wireless Networks
We consider the problem of constructing a bounded-degree planar geometric spanner for a unit disk graph modeling a wireless network. The related problem of constructing a planar geometric spanner of a Euclidean graph has been extensively studied in the literature. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor ; however, its degree may not be bound...
متن کاملOn Plane Constrained Bounded-Degree Spanners
Let P be a finite set of points in the plane and S a set of non-crossing line segments with endpoints in P . The visibility graph of P with respect to S, denoted Vis(P, S), has vertex set P and an edge for each pair of vertices u, v in P for which no line segment of S properly intersects uv. We show that the constrained half-θ6-graph (which is identical to the constrained Delaunay graph whose e...
متن کاملOn Spanners and Lightweight Spanners of Geometric Graphs
We consider the problem of computing spanners of Euclidean and unit disk graphs embedded in the two-dimensional Euclidean plane. We are particularly interested in spanners that possess useful properties such as planarity, bounded degree, and/or light weight. Such spanners have been extensively studied in the area of computational geometry and have been used as the building block for constructin...
متن کاملE cient Construction of a Bounded Degree Spanner with Low Weight
Let S be a set of n points in IR and let t be a real number A t spanner for S is a graph having the points of S as its vertices such that for any pair p q of points there is a path between them of length at most t times the Euclidean distance between p and q An e cient implementation of a greedy algorithm is given that constructs a t spanner having bounded degree such that the total length of a...
متن کامل